We revisit the method of Kirschenhofer, Prodinger and Tichy to calculate themoments of comparisons used by the quick sort algorithm. We reemphasize thatthis approach helps in calculating these quantities with less computation. Wealso point out that as observed by Knuth this method also gives moments fortotal path length of a binary search tree built over a random set of n keys.
展开▼
